Fast Pattern Recognition Using Gradient-Descent Search in an Image Pyramid
نویسندگان
چکیده
A new technique for fast pattern recognition using normalized grey-scale correlation (NGC) is described. While NGC has traditionally been slow due to computational intensity issues, the introduction of both a pyramid structure and a local estimate of the correlation surjace gradient allows for recognition in 10-50 ms using modest microcomputer hardware. The algorithm is designed to analyze the target ofline prior to starting the search. Issues surrounding determining an appropriate depth for the pyramid representation and peiforming sub-pixel localization of the target instance are discussed. The speed and robustness of the method makes it attractive for industrial applications.
منابع مشابه
Handwritten Character Recognition using Modified Gradient Descent Technique of Neural Networks and Representation of Conjugate Descent for Training Patterns
The purpose of this study is to analyze the performance of Back propagation algorithm with changing training patterns and the second momentum term in feed forward neural networks. This analysis is conducted on 250 different words of three small letters from the English alphabet. These words are presented to two vertical segmentation programs which are designed in MATLAB and based on portions (1...
متن کاملAn improved fast encoding algorithm for vector quantization using 2-pixel-merging sum pyramid data structure
Vector quantization (VQ) is an asymmetric coding method and the winner search in encoding process is extremely time-consuming. This property of VQ constrains its practical applications very much. Based on the sum pyramid data structure of a vector, a fast encoding algorithm with PSNR equivalent to full search is proposed in this paper to improve the results that have been given in [Pattern Reco...
متن کاملImproved Generalization in Recurrent Neural Networks Using the Tangent Plane Algorithm
The tangent plane algorithm for real time recurrent learning (TPA-RTRL) is an effective online training method for fully recurrent neural networks. TPA-RTRL uses the method of approaching tangent planes to accelerate the learning processes. Compared to the original gradient descent real time recurrent learning algorithm (GD-RTRL) it is very fast and avoids problems like local minima of the sear...
متن کاملAutomatic Face Recognition via Local Directional Patterns
Automatic facial recognition has many potential applications in different areas of humancomputer interaction. However, they are not yet fully realized due to the lack of an effectivefacial feature descriptor. In this paper, we present a new appearance based feature descriptor,the local directional pattern (LDP), to represent facial geometry and analyze its performance inrecognition. An LDP feat...
متن کاملDeterministic search for relational graph matching
This paper describes a comparative study of various deterministic discrete search-strategies for graph-matching. The framework for our study is provided by the Bayesian consistency measure recently reported by Wilson and Hancock (IEEE PAMI 19 (1997) 634}648; Pattern Recognition 17 (1996) 263}276) and Wilson et al. (Comput. Vision Image Understanding 72 (1998) 20}38') We investigate two classes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000